Least Common Ancestor Networks
نویسندگان
چکیده
Least Common Ancestor Networks (LCANs) are introduced and shown to be a class of networks that include fat-trees, baseline networks, SW-banyans and the router networks of the TRAC 1.1 and 2.0, and the CM-5. Some LCAN properties are stated and the permutation routing capabilities of an important subclass are analyzed. Simulation results for three permutation classes verify the accuracy of an iterative solution for a randomized routing strategy.
منابع مشابه
Service address routing: a network-embedded resource management layer for cluster computing
Service address routing is introduced as a novel and powerful paradigm for the integration of resource management functions into the interconnection fabric of cluster computers. SAR provides a ‘‘location independent’’ mechanism for the distribution of computations (services) among the computational resources of the cluster. The intelligence to allocate services and, later on, invoke their insta...
متن کاملEngineering Tree Labeling Schemes: A Case Study on Least Common Ancestors
We address the problem of labeling the nodes of a tree such that one can determine the identifier of the least common ancestor of any two nodes by looking only at their labels. This problem has application in routing and in distributed computing in peer-to-peer networks. A labeling scheme using Θ(log n)-bit labels has been previously presented by Peleg. By engineering this scheme, we obtain a v...
متن کاملInformative Labeling Schemes for the Least Common Ancestor Problem
We address the problem of labeling the nodes of a tree such that one can determine the identifier of the least common ancestor of any two nodes by looking only at their labels. This problem has application in routing and in distributed computing in peer-to-peer networks. A labeling scheme using Θ(log n)-bit labels has been presented by Peleg. By engineering this scheme and a new one due to the ...
متن کاملWinter School 2003, St. Petersburg The Least Common Ancestor Problem
The Least Common Ancestor Problem can be used to solve many other algorithmic problems on trees. It is shown that an efficient and simple solution is possible.
متن کامل.1 Range Minimum Query (rmq) 1.2 Lowest Common Ancestor (lca)
We care not only about the value of the minimum element, but also about the index k of the minimum element between A[i] and A[j]; given the index, it is easy to look up the actual value of the minimum element, so it is a more interesting problem to find the index of the minimum element between A[i] and A[j]. The range minimum query problem is not a tree problem, but it closely related to a tree...
متن کامل